Optimized Projection Matrix for Compressive Sensing
نویسندگان
چکیده
منابع مشابه
Optimized Projection Matrix for Compressive Sensing
Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the p...
متن کاملOptimized Sparse Projections for Compressive Sensing
We consider designing a sparse sensing matrix which contains few non-zero entries per row for compressive sensing (CS) systems. By unifying the previous approaches for optimizing sensing matrices based on minimizing the mutual coherence, we propose a general framework for designing a sparse sensing matrix that minimizes the mutual coherence of the equivalent dictionary and is robust to sparse r...
متن کاملAn Optimized Toeplitz Measurement Matrix based on ANN for Compressive Sensing ⋆
Compressive sensing takes advantage of the signals in some domain, allowing the entire signal to efficiently acquired and reconstructed from relatively few measurements. Toeplitz matrix has more advantages in the amount of data and computation over Gaussian random matrix, but its far from Gaussian matrix in the performance of signal reconstruction. In this paper, Toeplitz matrix is employed and...
متن کاملConvergence of the Generalized Alternating Projection Algorithm for Compressive Sensing
The convergence of the generalized alternating projection (GAP) algorithm is studied in this paper to solve the compressive sensing problem y = Ax + . By assuming that AA> is invertible, we prove that GAP converges linearly within a certain range of step-size when the sensing matrix A satisfies restricted isometry property (RIP) condition of δ2K , where K is the sparsity of x. The theoretical a...
متن کاملZero-point attracting projection algorithm for sequential compressive sensing
Sequential Compressive Sensing, which may be widely used in sensing devices, is a popular topic of recent research. This paper proposes an online recovery algorithm for sparse approximation of sequential compressive sensing. Several techniques including warm start, fast iteration, and variable step size are adopted in the proposed algorithm to improve its online performance. Finally, numerical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2010
ISSN: 1687-6180
DOI: 10.1155/2010/560349